Multilevel preconditioning for partition of unity methods: some analytic concepts
نویسندگان
چکیده
This paper is concerned with the construction and analysis of multilevel Schwarz preconditioners for partition of unity methods applied to elliptic problems. We show under which conditions on a given multilevel partition of unity hierarchy (MPUM) one even obtains uniformly bounded condition numbers and how to realize such requirements. The main anlytical tools are certain norm equivalences based on two-level splits providing frames that are stable under taking subsets. Mathematics Subject Classification (2000) 46E35 · 65F35 · 65F10 · 65N30 This work has been supported in part by the European Community’s Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY), by the Leibniz-Programme of the German Research Foundation (DFG), and by the SFB 401 funded by DFG. W. Dahmen (B) Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056 Aachen, Germany e-mail: [email protected] URL: http://www.igpm.rwth-aachen.de/∼dahmen/ S. Dekel GE Healthcare, 6 Hamasger St., Or-Yehuda 60408, Israel e-mail: [email protected] URL: http://shaidekel.tripod.com/ P. Petrushev Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA e-mail: [email protected] URL: http://www.math.sc.edu/∼pencho/
منابع مشابه
Multilevel Preconditioning for Partition of Unity
This paper is concerned with the construction and analysis of multilevel Schwarz preconditioners for partition of unity methods applied to elliptic problems. We show under which conditions on a given multilevel partition of unity hierarchy (MPUM) one even obtains uniformly bounded condition numbers and how to realize such requirements. The main anlytical tools are certain norm equivalences base...
متن کاملApplications of Domain Decomposition and Partition of Unity Methods in Physics and Geometry
We consider a class of adaptive multilevel domain decomposition-like algorithms, built from a combination of adaptive multilevel finite element, domain decomposition, and partition of unity methods. These algorithms have several interesting features such as very low communication requirements, and they inherit a simple and elegant approximation theory framework from partition of unity methods. ...
متن کاملUnity Methods in Physics and Geometry
1. Introduction. In this article we consider a class of adaptive multilevel domain decomposition-like algorithms, built from a combination of adaptive multilevel finite element, domain decomposition, and partition of unity methods. These algorithms have several interesting features such as very low communication requirements, and they inherit a simple and elegant approximation theory framework ...
متن کاملA Particle-Partition of Unity Method Part VII: Adaptivity
This paper is concerned with the adaptive multilevel solution of elliptic partial differential equations using the partition of unity method. While much of the work on meshfree methods is concerned with convergence-studies, the issues of fast solution techniques for the discrete system of equations and the construction of optimal order algorithms are rarely addressed. However, the treatment of ...
متن کاملA Particle-Partition of Unity Method-Part III: A Multilevel Solver
In this sequel to [15, 16] we focus on the efficient solution of the linear block-systems arising from a Galerkin discretization of an elliptic partial differential equation of second order with the partition of unity method (PUM). We present a cheap multilevel solver for partition of unity discretizations of any order. The shape functions of a PUM are products of piecewise rational partition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerische Mathematik
دوره 107 شماره
صفحات -
تاریخ انتشار 2007